A Dynamic Traveling Salesman Problem with Stochastic Arc Costs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Traveling Salesman Problem with Stochastic Arc Costs

We propose a dynamic traveling salesman problem (TSP) with stochastic arc costs motivated by applications, such as dynamic vehicle routing, in which a decision’s cost is known only probabilistically beforehand but is revealed dynamically before the decision is executed. We formulate the problem as a dynamic program (DP) and compare it to static counterparts to demonstrate the dynamic paradigm’s...

متن کامل

The Multi-Path Traveling Salesman Problem with Stochastic Travel Costs

Given a set of nodes, where each pair of nodes is connected by several paths and each path shows a stochastic travel cost with unknown distribution, the multipath Traveling Salesman Problem (TSP) with stochastic travel costs aims at finding an expected minimum Hamiltonian tour connecting all nodes. Under a mild assumption on the unknown probability distribution a deterministic approximation of ...

متن کامل

Waiting Strategies for the Dynamic and Stochastic Traveling Salesman Problem

⎯In the Dynamic and Stochastic Traveling Salesman Problem (DSTSP) a vehicle has to service a number of requests which are disclosed in a dynamic fashion over a planning horizon. When the vehicle is temporarily idle, one option is to reposition it in anticipation of future demand. The aim of this paper is to study waiting strategies for the DSTSP under a probabilistic characterization of custome...

متن کامل

The pickup and delivery traveling salesman problem with handling costs

This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and rel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2014

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.2014.1301